- minimum-hop routing
- маршрутизация с минимальным числом переприемов
English-Russian dictionary of telecommunications and their abbreviations. A.V. Alexandrov.. 2004.
minimum-hop routing
Смотреть что такое "minimum-hop routing" в других словарях:
List of ad-hoc routing protocols — An Ad hoc routing protocol is a convention or standard that controls how nodes come to agree which way to route packets between computing devices in a mobile ad hoc network (MANET).In ad hoc networks , nodes do not have a priori knowledge of… … Wikipedia
Backward learning routing — is a routing strategy for networks where the network nodes acquire knowledge of the network state as packets are handled. The routing is originally random. A packet with a hopcount of one is from a directly connected node. Thus, neighboring nodes … Wikipedia
Enhanced Interior Gateway Routing Protocol — (EIGRP) is a Cisco proprietary routing protocol loosely based on their original IGRP. EIGRP is an advanced distance vector routing protocol, with optimizations to minimize both the routing instability incurred after topology changes, as well as… … Wikipedia
Hazy Sighted Link State Routing Protocol — The Hazy Sighted Link State Routing Protocol (HSLS) is a wireless mesh network routing protocol being developed by the CUWiN Foundation. This is an algorithm allowing computers communicating via digital radio in a mesh network to forward messages … Wikipedia
ExOR (wireless network protocol) — Extremely Opportunistic Routing (ExOR) is a combination of routing protocol and media access control for a wireless ad hoc network, invented by Sanjit Biswas and Robert Morris of the MIT Artificial Intelligence Laboratory, and described in a 2005 … Wikipedia
Border Gateway Protocol — Pour les articles homonymes, voir BGP. Pile de protocoles 7. Application 6. … Wikipédia en Français
IPv6 — Internet protocol suite Application layer BGP DHCP DNS FTP … Wikipedia
6LoWPAN — est l acronyme de IPv6 Low power Wireless Personal Area Networks[note 1] ou IPv6 LoW Power wireless Area Networks[note 2]. C est également le nom d un groupe de travail de l IETF. Le groupe 6LoWPAN a défini les mécanismes d encapsulation et de… … Wikipédia en Français
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance … Wikipedia
Network coding — is a technique where, instead of simply relaying the packets of information they receive, the nodes of a network will take several packets and combine them together for transmission. This can be used to attain the maximum possible information… … Wikipedia
